Matroid tree-width
نویسندگان
چکیده
We show that the tree-width of a graph can be defined without reference to graph vertices, and hence the notion of tree-width can be naturally extended to matroids. (This extension was inspired by an original unpublished idea of Jim Geelen.) We prove that the tree-width of a graphic matroid is equal to that of its underlying graph. Furthermore, we extend the well-known relation between the branch-width and the tree-width of a graph to all matroids.
منابع مشابه
Games for width parameters and monotonicity
We introduce a search game for two players played on a scenario consisting of a ground set together with a collection of feasible partitions. This general setting allows us to obtain new characterisations of many width parameters such as rank-width and carvingwidth of graphs, matroid tree-width and GF(4)-rank-width. We show that the monotone game variant corresponds to a tree decomposition of t...
متن کاملThe Tutte Polynomial for Matroids of Bounded Branch-Width
It is a classical result of Jaeger, Vertigan and Welsh that evaluating the Tutte polynomial of a graph is #P -hard in all but few special points. On the other hand, several papers in past years have shown that the Tutte polynomial of a graph can be efficiently computed for graphs of bounded tree-width. In this paper we present a recursive formula computing the Tutte polynomial of a matroid M re...
متن کاملA Parametrized Algorithm for Matroid Branch-Width
Branch-width is a structural parameter very closely related to tree-width, but branch-width has an immediate generalization from graphs to matroids. We present an algorithm that, for a given matroid M of bounded branch-width t which is represented over a finite field, finds a branch decomposition of M of width at most 3t in cubic time. Then we show that the branch-width of M is a uniformly fixe...
متن کاملOn zeros of the characteristic polynomial of matroids of bounded tree-width
We develop some basic tools to work with representable matroids of bounded tree-width and use them to prove that, for any prime power q and constant k, the characteristic polynomial of any loopless, GF (q)representable matroid with tree-width k has no real zero greater than qk−1.
متن کاملAddendum to matroid tree-width
Abstract. Hliněný and Whittle have shown that the traditional treewidth notion of a graph can be defined without an explicit reference to vertices, and that it can be naturally extended to all matroids. Unfortunately their original paper Matroid tree-width, European J. Combin. 27 (2006), 1117–1128, as pointed out by Isolde Adler in 2007, contained some incorrect arguments. It is the purpose of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 27 شماره
صفحات -
تاریخ انتشار 2006